#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long mod = 1000000007;
class Solution {
public:
    vector<int> dp = vector<int>(107);  //保存楼梯数
    int numWays(int n) {
        for(int i = 0; i<=n ; i++)
            if(i<=2)
                dp[i]=i;
            else dp[i] = (dp[i-1]+dp[i-2])%mod;
        return n==0?1:dp[n];
    }
};
int main(int argc, char ** argv){
    Solution *solution = new Solution();
    cout<<solution->numWays(100)<<endl;
    return 0;
}